Example-Guided Abstraction Simplification

نویسندگان

  • Roberto Giacobazzi
  • Francesco Ranzato
چکیده

In static analysis, approximation is typically encoded by abstract domains, providing systematic guidelines for specifying approximate semantic functions and precision assessments. However, it may well happen that an abstract domain contains redundant information for the specific purpose of approximating a given semantic function modeling some behavior of a system. This paper introduces Example-Guided Abstraction Simplification (EGAS), a methodology for simplifying abstract domains, i.e. removing abstract values from them, in a maximal way while retaining exactly the same approximate behavior of the system under analysis. We show that, in abstract model checking and predicate abstraction, EGAS provides a simplification paradigm of the abstract state space that is guided by examples, meaning that it preserves spuriousness of examples (i.e., abstract paths). In particular, we show how EGAS can be integrated with the well-known CEGAR (CounterExample-Guided Abstraction Refinement) methodology.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Grouping of Non-connected Structures by an Irregular Graph Pyramid

Motivated by claims to ‘bridge the representational gap between image and model features’ and by the growing importance of topological properties we discuss several extensions to dual graph pyramids: structural simplification should preserve important topological properties and content abstraction could be guided by an external knowledge base. We review multilevel graph hierarchies under the sp...

متن کامل

Hierarchical grouping of non-connected structures

We review multilevel hierarchies under the special aspect of their potential for abstraction and grouping. Motivated by claims to ’bridge the representational gap between image and model features’ and by the growing importance of topological properties we discuss several extensions to dual graph pyramids: structural simplification should preserve important topological properties and content abs...

متن کامل

Conflict-Guided Simplification for SAT

Boolean satisfiability (SAT) solvers are the computational engines for a variety of applications, including those in verification and synthesis. The NP-completeness of SAT implies that solvers often run out of time and space resources in practice, resulting in an inconclusive answer even after using up significant computational resources. In this paper, we present a method to automatically gene...

متن کامل

Partial Predicate Abstraction and Counter-Example Guided Refinement

In this paper we present a counter-example guided abstraction and approximation refinement (CEGAAR) technique for {\em partial predicate abstraction}, which combines predicate abstraction and fixpoint approximations for model checking infinite-state systems. The proposed approach incrementally considers growing sets of predicates for abstraction refinement. The novelty of the approach stems fro...

متن کامل

Reachability Analysis of Hybrid Systems using Counter-Example Guided Predicate Abstraction∗

Predicate abstraction has emerged to be a powerful technique for extracting finite-state models from infinite-state discrete programs. This report presents algorithms and tools for reachability analysis of hybrid systems by combining the notion of counter-example guided predicate abstraction with recent techniques for approximating the set of reachable states of linear systems using polyhedra. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010